Relative Worst-order Analysis

نویسندگان

چکیده

The standard measure for the quality of online algorithms is competitive ratio. This generally applicable, and some problems it works well, but others fails to distinguish between that have very different performance. Thus, ever since its introduction, researchers worked on improving measure, defining variants, or measures based other concepts improve situation. Relative worst-order analysis (RWOA) one most thoroughly tested such proposals. With RWOA, many separations not obtainable with been found. In two are compared directly, rather than indirectly as done in analysis, where both separately an optimal offline algorithm. If, up permutations request sequences, algorithm always at least good sometimes better another, then first deemed by RWOA. We survey important results obtained this technique compare measures. includes a quite complete set references.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relative Worst-Order Analysis: A Survey

Relative worst-order analysis is a technique for assessing the relative quality of online algorithms. We survey the most important results obtained with this technique and compare it with other quality measures.

متن کامل

Separating Scheduling Algorithms with the Relative Worst Order Ratio

The relative worst order ratio is a measure for the quality of online algorithms. Unlike the competitive ratio, it compares algorithms directly without involving an optimal offline algorithm. The measure has been successfully applied to problems like paging and bin packing. In this paper, we apply it to machine scheduling. We show that for preemptive scheduling, the measure separates multiple p...

متن کامل

Separating online scheduling algorithms with the relative worst order ratio

The relative worst order ratio is a measure for the quality of online algorithms. Unlike the competitive ratio, it compares algorithms directly without involving an optimal offline algorithm. The measure has been successfully applied to problems like paging and bin packing. In this paper, we apply it to machine scheduling. We show that for preemptive scheduling, the measure separates multiple p...

متن کامل

Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis

Access graphs, which have been used previously in connection with competitive analysis to model locality of reference in paging, are considered in connection with relative worst order analysis. In this model, FWF is shown to be strictly worse than both LRU and FIFO on any access graph. LRU is shown to be strictly better than FIFO on paths and cycles, but they are incomparable on some families o...

متن کامل

The Relative Worst Order Ratio for On-Line Bin Packing Algorithms∗

The relative worst order ratio, a new measure for the quality of online algorithms, was defined in [3]. Classical bin packing algorithms such as First-Fit, Best-Fit, and Next-Fit were analyzed using this measure, giving results that are consistent with those previously obtained with the competitive ratio or the competitive ratio on accommodating sequences, but also giving new separations and ea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Computing Surveys

سال: 2021

ISSN: ['0360-0300', '1557-7341']

DOI: https://doi.org/10.1145/3425910